Heavy Viable Trajectories of Controlled Systems

We define and study the concept of heavy viable trajectories of a controlled system with feedbacks. Viable trajectories are trajectories satisfying at each instant given constraints on the state. The controls regulating viable trajectories evolve according a set-valued feedback map. Heavy viable trajectories are the ones which are associated to the controls in the feedback map whose velocity has at each instant the minimal norm. We construct the differential equation governing the evolution of the controls associated to heavy viable trajectories and we prove their existence

Fixed points of dynamic processes of set-valued F-contractions and application to functional equations

The article is a continuation of the investigations concerning F-contractions which have been recently introduced in [Wardowski in Fixed Point Theory Appl. 2012:94,2012]. The authors extend the concept of F-contractive mappings to the case of nonlinear F-contractions and prove a fixed point theorem via the dynamic processes. The paper includes a non-trivial example which shows the motivation for such investigations. The work is summarized by the application of the introduced nonlinear F-contractions to functional equations

Generating and Adding Flows on Locally Complete Metric Spaces

As a generalization of a vector field on a manifold, the notion of an arc field on a locally complete metric space was introduced in \cite{BC}. In that paper, the authors proved an analogue of the Cauchy-Lipschitz Theorem i.e they showed the existence and uniqueness of solution curves for a time independent arc field. In this paper, we extend the result to the time dependent case, namely we show the existence and uniqueness of solution curves for a time dependent arc field. We also introduce the notion of the sum of two time dependent arc fields and show existence and uniqueness of solution curves for this sum.Comment: 29 pages,6 figure

Existence and uniqueness for Mean Field Games with state constraints

In this paper, we study deterministic mean field games for agents who operate in a bounded domain. In this case, the existence and uniqueness of Nash equilibria cannot be deduced as for unrestricted state space because, for a large set of initial conditions, the uniqueness of the solution to the associated minimization problem is no longer guaranteed. We attack the problem by interpreting equilibria as measures in a space of arcs. In such a relaxed environment the existence of solutions follows by set-valued fixed point arguments. Then, we give a uniqueness result for such equilibria under a classical monotonicity assumption

Beyond local Nash equilibria for adversarial networks

Save for some special cases, current training methods for Generative Adversarial Networks (GANs) are at best guaranteed to converge to a ‘local Nash equilibrium’ (LNE). Such LNEs, however, can be arbitrarily far from an actual Nash equilibrium (NE), which implies that there are no guarantees on the quality of the found generator or classifier. This paper proposes to model GANs explicitly as finite games in mixed strategies, thereby ensuring that every LNE is an NE. We use the Parallel Nash Memory as a solution method, which is proven to monotonically converge to a resource-bounded Nash equilibrium. We empirically demonstrate that our method is less prone to typical GAN problems such as mode collapse and produces solutions that are less exploitable than those produced by GANs and MGANs

Continuity for s-convex fuzzy processes

In a previous paper we introduced the concept of s-convex fuzzy mapping and established some properties. In this work we study the continuity for s-convex fuzzy processes

A Semi-Lagrangian scheme for a modified version of the Hughes model for pedestrian flow

In this paper we present a Semi-Lagrangian scheme for a regularized version of the Hughes model for pedestrian flow. Hughes originally proposed a coupled nonlinear PDE system describing the evolution of a large pedestrian group trying to exit a domain as fast as possible. The original model corresponds to a system of a conservation law for the pedestrian density and an Eikonal equation to determine the weighted distance to the exit. We consider this model in presence of small diffusion and discuss the numerical analysis of the proposed Semi-Lagrangian scheme. Furthermore we illustrate the effect of small diffusion on the exit time with various numerical experiments

On stationary points of nonexpansive set-valued mappings

In this paper we deal with stationary points (also known as endpoints) of nonexpansive set-valued mappings and show that the existence of such points under certain conditions follows as a consequence of the existence of approximate stationary sequences. In particular we provide abstract extensions of well-known fixed point theorems.Dirección General de Enseñanza SuperiorJunta de Andalucí